Bi-level Scenario-based Location-allocation-inventory Models for Post-crisis Conditions and Solving with Electromagnetic and Genetic Algorithms

نویسندگان

چکیده

Incidents that occur suddenly due to natural and human functions impose hardships on society are called crises. As the Earth’s climate changes have increased number of crises, including earthquakes, floods, hurricanes, etc., in recent years, beings felt need for crisis management necessary planning critical situations more than ever. This research aims model solve problem location, allocation, inventory post-crisis conditions. To meet this purpose, first, we conducted a review previous papers. Then, identified gaps situations. In study, uncertain budgets demands bi-level programming decision-making innovations. result, developed mixed-integer linear mathematical models cover gaps. Finally, several problems been solved small dimensions by GAMS software large-sized genetic electromagnetic meta-heuristic algorithms. analyzed algorithms’ performance which indicates algorithm is better issue.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact algorithms for solving a bi-level location–allocation problem considering customer preferences

The issue discussed in this paper is a bi-level problem in which two rivals compete in attracting customers and maximizing their profits which means that competitors competing for market share must compete in the centers that are going to be located in the near future. In this paper, a nonlinear model presented in the literature considering customer preferences is linearized. Customer behavior ...

متن کامل

A Bi-level Formulation for Centralized Resource Allocation DEA Models

In this paper, the common centralized DEA models are extended to the bi-level centralized resource allocation (CRA) models based on revenue efficiency. Based on the Karush–Kuhn–Tucker (KKT) conditions, the bi-level CRA model is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). A recurrent neural network is developed for solving this one-level mathematica...

متن کامل

A Customized Bi-Objective Location-Routing Problem for Locating Post Offices and Delivery of Post Parcels

One of the most important problems for distribution companies is to find the best locations for depots and to find proper routes for transportation vehicles and to optimize supply network. This study intends to develop a model for the problem of location-routing in post offices. So, a new Bi-Objective Location-Routing Problem for Locating Town Post Office and Routing Parcels is defined. This pr...

متن کامل

A realistic perish ability inventory management for location-inventory-routing problem based on Genetic Algorithm

In this paper, it was an attempt to be present a practical perishability inventory model. The proposed model adds using spoilage of products and variable prices within a time period to a recently published location-inventory-routing model in order to make it more realistic. Aforementioned model by integration of strategic, tactical and operational level decisions produces better results for sup...

متن کامل

Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems

This paper examines the application of a genetic algorithm used in conjunction with a local improvement procedure for solving the location-allocation problem, a traditional multifacility location problem. This problem is difficult to solve using traditional optimization techniques because of its multimodal, nonconvex nature. The alternate location-allocation (ALA) method has been shown to be an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International journal of engineering. Transactions A: basics

سال: 2022

ISSN: ['1728-1431']

DOI: https://doi.org/10.5829/ije.2022.35.10a.01